Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
نویسندگان
چکیده
منابع مشابه
Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
Adjoint equations of differential equations have seen widespread applications in optimization, inverse problems, and uncertainty quantification. A major challenge in solving adjoint equations for time dependent systems has been the need to use the solution of the original system in the adjoint calculation and the associated memory requirement. In applications where storing the entire solution h...
متن کاملUnsteady Adjoint Approach for Design Optimization of Flapping Airfoils
This paper describes the work for optimizing the propulsive efficiency of flapping airfoils, i.e., improving the thrust under constraining aerodynamic work during the flapping flights by changing their shape and trajectory of motion with the unsteady discrete adjoint approach. For unsteady problems, it is essential to properly resolving time scales of motion under consideration and it must be c...
متن کاملA Monte Carlo method for solving unsteady adjoint equations
Traditionally, solving the adjoint equation for unsteady problems involves solving a large, structured linear system. This paper presents a variation on this technique and uses a Monte Carlo linear solver. The Monte Carlo solver yields a forward-time algorithm for solving unsteady adjoint equations. When applied to computing the adjoint associated with Burgers’ equation, the Monte Carlo approac...
متن کاملAdjoint-based Unsteady Airfoil Design Optimization with Application to Dynamic Stall
This paper presents the development and application of an adjoint-based optimization method to designing airfoils with the objective of alleviating dynamic stall effects in helicopter rotor blades. The unsteady flow problem is simulated using the NSU2D code, which is a two-dimensional unsteady, viscous, turbulent Reynolds averaged Navier-Stokes (RANS) finite-volume solver. The corresponding adj...
متن کاملDynamic Reconfiguration: Checkpointing Code Generation
We describe a competent base checkpointing code generation tool. Scientific applications that require long computation runtimes experience the risk of hardware or software failures. Failure during a long computation requires that the application restart the calculations from the beginning. Checkpointing important data at set intervals and using that data during a restart of the application mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2009
ISSN: 1064-8275,1095-7197
DOI: 10.1137/080727890